To the question of existence of exact irreducible representations of soluble groups of finite rank over locally finite field
نویسندگان
چکیده
منابع مشابه
buckling of viscoelastic composite plates using the finite strip method
در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....
Linear representations of soluble groups of finite Morley rank
Sufficient conditions are given for groups of finite Morley rank having non-trivial torsion-free nilpotent normal subgroups to have linear representations with small kernels. In particular, centreless connected soluble groups of finite Morley rank with torsion-free Fitting subgroups have faithful linear representations. On the way, using a notion of definable weight space, we prove that certain...
متن کاملComputing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...
متن کاملRepresentations of Locally Finite Groups
The purpose of this paper is to give a brief general account of the completely reducible finite-dimensional representations of a locally finite group G over a given algebraically closed field K. Theorem 1 shows that all such representations of G can be brought down to the algebraic closure F in K of the prime field of K. This reduces all further considerations in this account to countable group...
متن کاملComputing Irreducible Representations of Finite Groups
We consider the bit-complexity of the problem stated in the title. Exact computations in algebraic number fields are performed symbolically. We present a polynomial-time algorithm to find a complete set of nonequivalent irreducible representations over the field of complex numbers of a finite group given by its multiplication table. In particular, it follows that some representative of each equ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Researches in Mathematics
سال: 2021
ISSN: 2664-5009,2664-4991
DOI: 10.15421/240722